#pragma once
#include "RBTree.h"

namespace ljt
{
	template<class K>
	class set
	{
	public:
		struct SetKeyOfT
		{
			const K& operator(const K& key)
			{
				return key;
			}
		};

		typedef typename RBTree<K, K, SetKeyOfT>::iterator iterator;

		iterator begin()
		{
			return _t.begin();
		}
		iterator end()
		{
			return _t.end();
		}

		bool insert(const pair<K, V>& kv)
		{
			return _t.Insert(kv);
		}
	private:
		RBTree<K, pair<K, V>, SetKeyOfT> _t;
	};
}